A Bi-Objective Scheduling Problem in a Home Care Business

نویسندگان

چکیده

In this work we study a routing and scheduling problem for home care business. The is composed of two conflicting objectives, therefore it as bi-objective one. We obtain the Pareto frontier small size instances using AUGMECON2 method and, bigger cases, developed an heuristic algorithm. also obtained some preliminary results that show algorithm has good behaviour.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

Solving a bi-objective manpower scheduling problem considering the utility of objective functions

This paper presents a novel bi-objective manpower scheduling problem that minimizes the penalty resulted from employees’ assignment at lower skill levels than their real skill and maximizes employees’ utility for working at a special skill level in some shifts or on some days. Employees are classified in two specialist groups and three skill levels in each specialization. In addition, the prese...

متن کامل

A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

متن کامل

A Bi-Objective Green Truck Routing and Scheduling Problem in a Cross Dock with the Learning Effect

We present a bi-objective model for a green truck scheduling and routing problem at a cross-docking system. This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving c...

متن کامل

a bi-objective model for a flowshop scheduling problem with availability constraint of machines

this paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. in this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering proceedings

سال: 2021

ISSN: ['2673-4591']

DOI: https://doi.org/10.3390/engproc2021007042